How Many Real Attractive Fixed Points Can A Polynomial Have?
نویسندگان
چکیده
We prove a complex polynomial of degree n has at most ⌈n/2⌉ attractive fixed points lying on a line. We also consider the general case.
منابع مشابه
Free group automorphisms with many fixed points at infinity
A concrete family of automorphisms αn of the free group Fn is exhibited, for any n ≥ 3, and the following properties are proved: αn is irreducible with irreducible powers, has trivial fixed subgroup, and has 2n− 1 attractive as well as 2n repelling fixed points at ∂Fn . As a consequence of a recent result of V Guirardel there can not be more fixed points on ∂Fn , so that this family provides th...
متن کاملFixed Point Polynomials of Permutation Groups
In this paper we study, given a group G of permutations of a finite set, the so-called fixed point polynomial ∑n i=0 fix i, where fi is the number of permutations in G which have exactly i fixed points. In particular, we investigate how root location relates to properties of the permutation group. We show that for a large family of such groups most roots are close to the unit circle and roughly...
متن کاملStrict fixed points of '{C}iri'{c}-generalized weak quasicontractive multi-valued mappings of integral type
Many authors such as Amini-Harandi, Rezapour et al., Kadelburg et al., have tried to find at least one fixed point for quasi-contractions when $alphain[frac{1}{2}, 1)$ but no clear answer exists right now and many of them either have failed or changed to a lighter version. In this paper, we introduce some new strict fixed point results in the set of multi-valued '{C}iri'{c}-gener...
متن کاملHow to define ‘Moral Realism’
Moral realism is the doctrine that some propositions asserting that some action is ‘morally’ good (obligatory, bad, or wrong) are true. This paper examines three different definitions of what it is for an action to be ‘morally’ good (with corresponding definitions for ‘morally’ obligatory, bad, or wrong) which would make moral realism a clear and plausible view. The first defines ‘morally good ...
متن کاملA rootfinding algorithm for line spectral frequencies
Published techniques for computing line spectral frequencies generally avoid rootfinding methods because of concerns about convergence and complexity. However, this paper shows that stable predictor polynomials have properties that make rootfinding an attractive approach. It is well known that the problem of finding the LSF’s for an N’th order predictor polynomial can be reduced to the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.07859 شماره
صفحات -
تاریخ انتشار 2016